Multi-step crossover genetic algorithm for bi-criteria parallel machine scheduling problems
نویسندگان
چکیده
منابع مشابه
A Mathematical Model of a Multi-Criteria Parallel Machine Scheduling Problem: a Genetic Algorithm (RESEARCH NOTE)
.
متن کاملA Genetic Algorithm with Multi-Step Crossover for Job-Shop Scheduling Problems
Genetic Algorithms (GAs) have been designed as general purpose optimization methods. GAs can be uniquely characterized by their population-based search strategies and their operators: mutation, selection and crossover. In this paper, we propose a new crossover called multi-step crossover (MSX) which utilizes a neighborhood structure and a distance in the problem space. Given parents, MSX succes...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملScheduling by Genetic Local Search with Multi-Step Crossover
In this paper, multi-step crossover (MSX) and a local search method are unified as a single operator called MSXF. MSX and MSXF utilize a neighborhood structure and a distance measure in the search space. In MSXF, a solution, initially set to be one of the parents, is stochastically replaced by a relatively good solution in the neighborhood, where the replacement is biased toward the other paren...
متن کاملA Branch-and-bound Algorithm for Parallel Machine Scheduling Problems
In this paper, a Branch-and-Bound (B&B) algorithm is presented to solve the problem of minimizing the maximum completion time Cmax on unrelated parallel machines with machine eligibility restrictions when job preemption is not allowed. A customized lower bound, a search and a branching strategy are developed for the B&B. A machine eligibility factor is also introduced to represent the percentag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics in Operational Research
سال: 2021
ISSN: ['1757-5850', '1757-5869']
DOI: https://doi.org/10.1504/ijmor.2021.112275